A unified view of class-selection with probabilistic classifiers
نویسندگان
چکیده
منابع مشابه
A unified view of class-selection with probabilistic classifiers
The possibility of selecting a subset of classes instead of one unique class for assignation is of great interest in many decision making systems. Selecting a subset of classes instead of singleton allows to reduce the error rate and to propose a reduced set to another classifier or an expert. This second step provides additional information, and therefore increases the quality of the result. I...
متن کاملProbabilistic Classifiers for Tracking Point of View
This paper describes work in developing probabilistic classifiers for a discourse segmentation problem that involves segmentation, reference resolution, and belief. Specifically, the problem is to segment a text into blocks such that all subjective sentences in a block are from the point of view of the same agent, and to identify noun phrases that refer to that agent. In our method for developi...
متن کاملCommittee-Based Sample Selection for Probabilistic Classifiers
In many real-world learning tasks it is expensive to acquire a suucient number of labeled examples for training. This paper investigates methods for reducing annotation cost by sample selection. In this approach, during training the learning program examines many unlabeled examples and selects for labeling only those that are most informative at each stage. This avoids redundantly labeling exam...
متن کاملA Unified View of Causal and Non-causal Feature Selection
In this paper, we unify causal and non-causal feature selection methods based on the Bayesian network framework. We first show that the objectives of causal and non-causal feature selection methods are equal and are to find the Markov blanket of a class attribute, the theoretically optimal feature set for classification. We demonstrate that causal and non-causal feature selection take different...
متن کاملA Unified View on Multi-class Support Vector Classification
A unified view on multi-class support vector machines (SVMs) is presented, covering most prominent variants including the one-vs-all approach and the algorithms proposed by Weston & Watkins, Crammer & Singer, Lee, Lin, & Wahba, and Liu & Yuan. The unification leads to a template for the quadratic training problems and new multi-class SVM formulations. Within our framework, we provide a comparat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2014
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2013.07.020